Geometric dilation of closed planar curves: A new lower bound
نویسندگان
چکیده
Given any simple closed curve C in the Euclidean plane, let w and D denote the minimal and the maximal caliper distances of C, correspondingly. We show that any such curve C has a geometric dilation of at least arcsin( w D ) + √
منابع مشابه
Geometric dilation of closed planar curves: New lower bounds
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all pairs of points on the curve, is called the geometric dilation of C. We provide lower bounds for the dilation of closed curves in terms of their geometric properties, and prove that the circle is the only closed curve...
متن کاملOn Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between p and q and their Euclidean distance. The supremum over all pairs of points of all these ratios is called the geometric dilation of G. Our research is motivated by the problem of designing graphs of low dilation. We ...
متن کاملar X iv : m at h . M G / 0 40 71 35 v 2 2 5 A ug 2 00 5 On the Geometric Dilation of Closed Curves , Graphs , and Point Sets ∗
Let G be an embedded planar graph whose edges are curves. The detour between two points p and q (on edges or vertices) of G is the ratio between the length of a shortest path connecting p and q in G and their Euclidean distance |pq|. The maximum detour over all pairs of points is called the geometric dilation δ(G). Ebbers-Baumann, Grüne and Klein have shown that every finite point set is contai...
متن کاملGeometric dilation and halving distance
Let G be a geometric graph in the plane whose edges may be curves. For two arbitrary points on its edges, we can compare the length of the shortest path in G connecting them against their Euclidean distance. The supremum of all these ratios is called the geometric dilation of G. Given a finite point set S, we would like to know the smallest possible dilation of any graph that contains the given...
متن کاملGeometric Dilation and Halving Distance
Let G be a geometric graph in the plane whose edges may be curves. For two arbitrary points on its edges, we can compare the length of the shortest path in G connecting them against their Euclidean distance. The supremum of all these ratios is called the geometric dilation of G. Given a finite point set S, we would like to know the smallest possible dilation of any graph that contains the given...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004